A combinatorial result on points and circles on the plane
نویسندگان
چکیده
Let P n be a collection of n points on the plane. For a pair of points u and v P n let C(u,v) be the minimum number of points of P n contained in any circle contaning u and v. In this paper we prove the result that there exist two points u o and v o P n such that any circle containing u o and v o contains at least È(n-2)/60˘ elements of P n (other than u o and v o). We also prove that the average value of C(u,v) over all pairs {u, v} P n is ≥ È(n-2)/60˘. For the case when P n are the vertices of a convex polygon, we prove that there exist two vertices u, v of P n such that any circle containing them contains at least È(n-2)/4˘ elements of P n .
منابع مشابه
A convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملOn the Complexity of Arrangements of Circles in the Plane
Continuing and extending the analysis in a previous paper [9], we establish several combinatorial results on the complexity of arrangements of circles in the plane. The main results are a collection of partial solutions to the conjecture that (a) any arrangement of unit circles with at least one intersecting pair has a vertex incident to at most 3 circles, and (b) any arrangement of circles of ...
متن کاملConstraining Plane Configurations in CAD: Circles, Lines, and Angles in the Plane
This paper investigates the local uniqueness of designs of m-circles (lines and circles) in the plane up to inversion under a set of angles of intersection as constraints. This local behavior is studied through the Jacobian of the angle measurements in a form analogous to the rigidity matrix for a framework of points with distance constraints. After showing directly that the complete set of ang...
متن کاملA TAXICAB VERSION OF A TRIANGLE' S APOLLONIUS CIRCLE
One of the most famous problems of classical geometry is the Apollonius' problem asks construction of a circle which is tangent to three given objects. These objects are usually taken as points, lines, and circles. This well known problem was posed by Apollonius of Perga ( about 262 - 190 B.C.) who was a Greek mathematician known as the great geometer of ancient times after Euclid and Archimede...
متن کاملCutting Circles into Pseudo-segments and Improved Bounds for Incidences
We show that n arbitrary circles in the plane can be cut into O(n) arcs, for any ε > 0, such that any pair of arcs intersect at most once. This improves a recent result of Tamaki and Tokuyama [20]. We use this result to obtain improved upper bounds on the number of incidences between m points and n circles. An improved incidence bound is also obtained for graphs of polynomials of any constant m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 69 شماره
صفحات -
تاریخ انتشار 1988